Constraint Programming for Data Mining and Machine Learning.

Integrating Constraint Programming and Itemset Mining.

Optimal constraint%2Dbased decision tree induction from itemset lattices.

Mining Predictive k%2DCNF Expressions.

A query language for analyzing networks.

A query language for analyzing networks.



Grammar Mining.
Abstract. In some applications of opinion mining in text, it is important to distinguish what an author is talking about from the subjective stance towards the topic. Therefore, it needs to find the relation between sentiment expression and target. This paper proposes a novel method based on dependency grammars to mine the relation. In this method, the process of mining the relations is turned into a procedure of searching in the dependency tree of a sentence. The result of our experiments shows that word dependency relation based methods is more flexible and effective than some previous surface patterns based methods.
Polynomial%2DDelay Enumeration of Monotonic Graph Classes.

Bayes optimal classification for decision trees.
We present an algorithm for exact Bayes optimal classification from a hypothesis space of decision trees satisfying leaf constraints. Our contribution is that we reduce this classification problem to the problem of finding a rulebased classifier with appropriate weights. We show that these rules and weights can be computed in linear time from the output of a modified frequent itemset mining algorithm, which means that we can compute the classifier in practice, despite the exponential worstcase complexity. In experiments we compare the Bayes optimal predictions with those of the maximum a posteriori hypothesis. 1.
Constraint programming for itemset mining.

What Is Frequent in a Single Graph%3F.

Mining optimal decision trees from itemset lattices.
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal trees has high theoretical complexity, until now no efforts have been made to compute such trees for real-world datasets. An exact algorithm is of both scientific and practical interest. From a scientific point of view, it can be used as a gold standard to evaluate the performance of heuristic decision tree learners and to gain new insight in these traditional learners. From the application point of view, it can be used to discover trees that cannot be found by heuristic decision tree learners. The key idea behind our algorithm is the relation between constraints on decision trees and constraints on itemsets. We propose to exploit lattices of itemsets, from which we can extract optimal decision trees in linear time. We give several strategies to efficiently build these lattices. Experiments show that under the same constraints, DL8 has better test results than C4.5 which confirm that exhaustive search does not always imply overfitting. The results also show that DL8 is a useful and interesting tool to learn decision trees under constraints.
General Graph Refinement with Polynomial Delay.
Of many graph mining algorithms an essential component is its procedure for enumerating graphs such that no two enumerated graphs are isomorphic. All frequent subgraph miners require such a component [14, 5, 1, 6], but also other
IQL A Proposal for an Inductive Query Language.
Clustering is an important tool for data mining, since it can  identify major patterns or trends without any supervision (labeled data).
Don%27t Be Afraid of Simpler Patterns.
Abstract. This paper investigates the trade-off between the expressiveness of the pattern language and the performance of the pattern miner in structured data mining. This trade-off is investigated in the context of correlated pattern mining, which is concerned with finding the k-best patterns according to a convex criterion, for the pattern languages of itemsets, multi-itemsets, sequences, trees and graphs. The criteria used in our investigation are the typical ones in data mining: computational cost and predictive accuracy and the domain is that of mining molecular graph databases. More specifically, we provide empirical answers to the following questions: how does the expressive power of the language affect the computational cost? and what is the trade-off between expressiveness of the pattern language and the predictive accuracy of the learned model? While answering the first question, we also introduce a novel stepwise approach to correlated pattern mining in which the results of mining a simpler pattern language are employed as a starting point for mining in a more complex one. This stepwise approach typically leads to significant speed-ups (up to a factor 1000) for mining graphs. 1
Substructure Mining Using Elaborate Chemical Representation.

Multi%2Dclass Correlated Pattern Mining.

The Gaston Tool for Frequent Subgraph Mining.

Frequent Subtree Mining %2D An Overview.
Mining frequent subtrees from databases of labeled trees is a new research field that has  many practical applications in areas such as computer networks, Web mining, bioinformatics, XML  document mining, etc. These applications share a requirement for the more expressive power of labeled  trees to capture the complex relations among data entities. Although frequent subtree mining is  a more difficult task than frequent itemset mining, most existing frequent subtree mining algorithms  borrow techniques from the relatively mature association rule mining area. This paper provides an  overview of a broad range of tree mining algorithms. We focus on the common theoretical foundations  of the current frequent subtree mining algorithms and their relationship with their counterparts  in frequent itemset mining. When comparing the algorithms, we categorize them according to their  problem definitions and the techniques employed for solving various subtasks of the subtree mining  problem. In addition, we also present a thorough performance study for a representative family of  algorithms.
Open source data mining workshop report.
Over the past decade tremendous progress has been made in data mining methods like clustering, classification, frequent pattern mining, and so on. Unfortunately, however, the advanced implementations are often not made publicly
Ideal Refinement of Datalog Clauses Using Primary Keys.

A quickstart in frequent structure mining can make a difference.

Frequent graph mining and its application to molecular databases.

Efficient Frequent Query Discovery in FARMER.
Abstract. The upgrade of frequent item set mining to a setup with multiple relations —frequent query mining — poses many efficiency problems. Taking Object Identity as starting point, we present several optimization techniques for frequent query mining algorithms. The resulting algorithm has a better performance than a previous ILP algorithm and competes with more specialized graph mining algorithms in performance. 1
An analysis of the behavior of simplified evolutionary algorithms on trap functions.

Faster Association Rules for Multiple Relations.
Several algorithms have already been implemented which combine association rules with first order logic formulas. Although this resulted in several usable algorithms, little attention was payed until recently to the efficiency of these algorithms. In this paper we present some new ideas to turn one important intermediate step in the process of discovering such rules, i.e. the discovery of frequent item sets, more efficient. Using an implementation that we coined FARMER, we show that indeed a speed-up is obtained and that, using these ideas, the performance is much more comparable to original association rule algorithms. 1
